Hadoop Scheduler with Deadline Constraint

Feasibility Intervals for the Deadline Driven Scheduler with Arbitrary Deadlines

In this paper, we extend the determination of feasibility intervals to task sets with arbitrary deadlines, both in the synchronous and the asynchronous case. Meanwhile we also improve the arguments and results generally found in the literature.

One-shot timer for Resource-Based Earliest Deadline First Scheduler

In a previous research project [5], we found there are several disadvantages of the current Linux scheduler. So we employed a alternative scheduler, Resource-Based Earliest Deadline First scheduler(RB-EDF), to solve these problems. Though RB-EDF performs better than the Linux scheduler in handling soft realtime processes, it can not enforce resource usages smaller than 1 tick(10ms) using the re...

Simulation and performance evaluation of the hadoop capacity scheduler

Hadoop task schedulers like Fair Share and Capacity have been specially designed to share hardware resources among multiple organizations. The Capacity Scheduler provides a complex set of parameters to give fine control over resource allocation of a shared MapReduce cluster. Administrators and users often run into performance problems because they do not understand the performance influence of ...

A Formal Proof of the Deadline Driven Scheduler

Scheduling in Hadoop An introduction to the pluggable scheduler framework

Hadoop implements the ability for pluggable schedulers that assign resources to jobs. However, as we know from traditional scheduling, not all algorithms are the same, and efficiency is workload and cluster dependent. Get to know Hadoop scheduling, and explore two of the algorithms available today: fair scheduling and capacity scheduling. Also, learn how these algorithms are tuned and in what s...